QUICKSHUNT--A Distributive Sorting Algorithm

A new sorting algorithm

We are introducing a new sorting algorithm.

An Algorithm for Distributive Unification

We consider unification of terms under the equational theory of two-sided distributivity D with the axioms x*(y+z) = x*y + x*z and (x+y)*z = x*z + y*z. The main result of this paper is that Dunification is decidable by giving a non-deterministic transformation algorithm. The generated unification are: an AC1-problem with linear constant restrictions and a second-order unification problem that c...

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

Derivation of a Sorting Algorithm

A Potential Spike Sorting Algorithm

This is a short summary of the work I did for 6 weeks as a summer intern with Conor Houghton. The topic of the internship was spike sorting, in particular to test an algorithm suggested by Dr.Houghton. I’ll first briefly describe spike sorting, at least my understanding of it. A few small biological details (which I’m sure are a simplification) a neuron fires ‘spikes’ of voltages; different typ...